Strongly Typed Genetic Programming
نویسنده
چکیده
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on particular data types, this can lead to unnecessarily large search times and/or unnecessarily poor generalization performance. Strongly typed genetic programming (STGP) is an enhanced version of genetic programming which enforces data type constraints and whose use of generic functions and generic data types makes it more powerful than other approaches to type constraint enforcement. After describing its operation, we illustrate its use on problems in two domains, matrix/vector manipulation and list manipulation, which require its generality. The examples are: (1) the multi-dimensional least-squares regression problem, (2) the multi-dimensional Kalman filter, (3) the list manipulation function NTH, and (4) the list manipulation function MAPCAR.
منابع مشابه
Bbn Technical Report #7866: Strongly Typed Genetic Programming
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection Koza 92]. However, it has the limitation known as \closure", i.e. that all the variables, constants, arguments for functions, and values returned from functions must be of the same data type. To correct this deeciency, we introduce a variation of genetic programming calle...
متن کاملDesigning Pheromone Update Strategies with Strongly Typed Genetic Programming
Ant Colony algorithms are population-based methods widely used in combinatorial optimization problems. We propose a strongly typed genetic programming approach to automatically evolve the communication mechanism that allows ants to cooperatively solve a given problem. Results obtained with several TSP instances show that the evolved pheromone update strategies are effective, exhibit a good gene...
متن کاملFunctional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operators with special cases to avoid creating ill-formed programs. We introduce combinator expressions as an alternative program representation for genetic programming, providing the same expressive power as strongly typed ...
متن کاملA Depth Controlling Strategy for Strongly Typed Evolutionary Programming
This paper presents a dynamic strategy for monitoring the depth of program trees evolved by STEPS (Strongly Typed Evolutionary Programming System). STEPS evolves higher-order functional programs in the form of trees, which are allowed to grow or shrink to fit the size of the problem, via specialised genetic operators. Thus, the need for arbitrary cut-off mechanisms is eliminated.
متن کاملEvolving Teleo-Reactive Programs for Block Stacking using Indexicals through Genetic Programming
This paper demonstrates how strongly-typed genetic programming may be used to evolve valid teleo-reactive programs that solve the general block-stacking problem using indexicals.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Evolutionary Computation
دوره 3 شماره
صفحات -
تاریخ انتشار 1995